An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
نویسندگان
چکیده
منابع مشابه
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S,+) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the set of intervals that contain x. Given a point q ∈ R, the stabbing-semigroup query asks for computing
متن کاملAn Optimal Data Structure for
We present a data structure that allows to preprocess a rectilinear polygon with n vertices such that, for any two query points, the shortest path in the rectilinear link or L 1-metric can be reported in time O(log n + k) where k is the link length of the shortest path. If only the distance is of interest, the query time reduces to O(log n). Furthermore, if the query points are two vertices, th...
متن کاملFully Dynamic Data Structure for LCE Queries in Compressed Space
A Longest Common Extension (LCE) query on a text T of length N asks for the length of the longest common prefix of suffixes starting at given two positions. We show that the signature encoding G of size w = O(min(z log N log∗M, N)) [Mehlhorn et al., Algorithmica 17(2):183198, 1997] of T , which can be seen as a compressed representation of T , has a capability to support LCE queries in O(log N ...
متن کاملAn Optimal Model for Medicine Preparation Using Data Mining
Introduction: Lack of financial resources and liquidity are the main problems of hospitals. Pharmacies are one of the sectors that affect the turnover of hospitals and due to lack of forecast for the use and supply of medicines, at the end of the year, encounter over-inventory, large volumes of expired medicines, and sometimes shortage of medicines. Therefore, medicine prediction using availabl...
متن کاملData Structures for Dynamic Queries : An Analytical and Experimental
Dynamic Queries is a querying technique for doing range search on multi-key data sets. It is a direct manipulation mechanism where the query is formulated using graphical widgets and the results are displayed graphically in real time. This paper evaluates four data structures, the multilist, the grid le, k-d tree and the quad tree used to organize data in high speed storage for dynamic queries....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/10078791x